Regular algebra applied to language problems
نویسندگان
چکیده
منابع مشابه
Regular algebra applied to language problems
Many functions on context-free languages can be expressed in the form of the least fixed point of a function whose definition mimics the grammar of the given language. Examples include the function returning the length of the shortest word in a language, and the function returning the smallest number of edit operations required to transform a given word into a word in a language. This paper pre...
متن کاملRegular Algebra Applied to Path - finding Problems
In an earlier paper, one of the authors presented an algebra for formulating and solving extremal path problems. There are striking similarities between that algebra and the algebra of regular languages, which lead one to consider whether the previous results can be generalized—for instance to path enumeration problems—and whether the algebra of regular languages can itself be profitably used f...
متن کاملApplied Linguistic Approach to Language Learning Strategies (A Critical Review)
From applied linguistic point of view, the fundamental question facing the language teachers, methodologists and course designers is which procedure is more effective in FL/SL: learning to use or using to learn? Definitely, in order to be a competent language user, knowledge of language system is necessary, but it is not sufficient to be a successful language user. That is why there was a gradu...
متن کاملBinary Relational Algebra Applied to Software Architecture
The architecture of a piece of software refers to its structure as given by its components and their interconnections. An architectural style is a set of commonalities among the structures of a number of software systems. We are concerned with architectures that are characterized by directed graphs. The graphs we are interested in contain edges that are "typed" or "colored", which means that th...
متن کاملModal Kleene Algebra Applied to Program Correctness
Modal Kleene algebras are relatives of dynamic logics that support program construction and verification by equational reasoning. We describe their application in implementing versatile program correctness components in interactive theorem provers such as Isabelle/HOL. Starting from a weakest precondition based component with a simple relational store model, we show how variants for Hoare logic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Logic and Algebraic Programming
سال: 2006
ISSN: 1567-8326
DOI: 10.1016/j.jlap.2005.04.008